Revising Horn Theories
نویسندگان
چکیده
This paper investigates belief revision where the underlying logic is that governing Horn clauses. It proves to be the case that classical (AGM) belief revision doesn’t immediately generalise to the Horn case. In particular, a standard construction based on a total preorder over possible worlds may violate the accepted (AGM) postulates. Conversely, Horn revision functions in the obvious extension to the AGM approach are not captured by total preorders over possible worlds. We address these difficulties by first restricting the semantic construction to “well behaved” orderings; and second, by augmenting the revision postulates by an additional postulate. This additional postulate is redundant in the AGM approach but not in the Horn case. In a representation result we show that these two approaches coincide. Arguably this work is interesting for several reasons. It extends AGM revision to inferentially-weaker Horn theories; hence it sheds light on the theoretical underpinnings of belief change, as well as generalising the AGM paradigm. Thus, this work is relevant to revision in areas that employ Horn clauses, such as deductive databases and logic programming, as well as areas in which inference is weaker than classical logic, such as in description logic.
منابع مشابه
Belief Revision: Revising Horn Clause Theories
This paper investigates belief revision where the underlying logic is that governing Horn clauses. It proves to be the case that classical (AGM) belief revision doesn’t immediately generalise to the Horn case. In particular, a standard construction based on a total preorder over possible worlds may violate the accepted (AGM) postulates. Conversely, Horn revision functions in the obvious extensi...
متن کاملAutomated Debugging of Logic Programs via Theory Revision
This paper presents results on using a theory revision system to automatically debug logic programs. Forte is a recently developed system for revising function-free Horn-clause theories. Given a theory and a set of training examples, it performs a hillclimbing search in an attempt to minimally modify the theory to correctly classify all of the examples. Forte makes use of methods from propositi...
متن کاملRevising Contextual Theories
The aim of this paper is to present a procedure for revising contextual theories. Contextual theories have been introduced by J. McCarthy and S. Buvač (McCarthy & Buvač 1994) and they are based on the following principle: generally, a formula is not true in an absolute way but should be considered in a relative way. Contextual reasoning aims at explictly stating that a statement φ is holding in...
متن کاملTheory Re nement with Noisy Data
This paper presents a method for revising an approximate domain theory based on noisy data. The basic idea is to avoid making changes to the theory that account for only a small amount of data. This method is implemented in the EITHER propositional Horn-clause theory revision system. The paper presents empirical results on articially corrupted data to show that this method successfully prevents...
متن کاملAbductive Explanations for Text Understanding: Some Problems and Solutions. Technical Report Number of Training Examples Flex-either Id3 7.2 Multiple Categories: Soybean Results
A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation. 27 [Michalski and Chilausky, 1980] R. S. Michalski and S. Chilausky. Learning by being told and learning from examples: An experimental comparison of the two methods of knowledge acquisition in the context of developing an expert system for soybean disease diagnosis. Acknowledgem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011